import com.sun.security.jgss.GSSUtil;

import java.util.*;

public class Test32 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n=in.nextInt();
        int k=in.nextInt();
        int d=in.nextInt();
        int[] a=new int[n];
        for(int i=0;i<n;i++) {
            a[i] = in.nextInt();
        }


    }









    public static void main02(String[] args) {
        Scanner in = new Scanner(System.in);
        int n=in.nextInt();
        long[] a=new long[n];
        long[] b=new long[n];
        for(int i=0;i<n;i++){
            a[i]=in.nextLong();
            b[i]=in.nextLong();
        }

        Arrays.sort(a);
        Arrays.sort(b);

        int ret=1;

        int left=1;
        int right=0;
        while(left < n){
            if(a[left] >= a[right]) {
                right=left++;
                ret++;
            }
            left++;
        }

        System.out.println(ret);
    }













    public static void main01(String[] args) {
        Scanner in = new Scanner(System.in);
        String s=in.nextLine();
        StringBuilder st=new StringBuilder("");
        st.append(s);
        for(int i=s.length()-2;i>=0;i--){
            st.append(s.charAt(i));
        }
        boolean b =palindrome(st);
        if(b) System.out.println("prime");
        else System.out.println("noprime");
    }

    private static boolean palindrome(StringBuilder st) {
        int a=0;
        int n=st.length();

        for(int i=n-1;i>=0;i--){
            a+=(st.charAt(n-1-i)-'0')*Math.pow(10,i);
        }

        for(int i=2;i<=Math.sqrt(a);i++){
            if(a%i == 0 ) return false;
        }
        return true;
    }
}
